Majority domination in graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Majority Domination Edge Critical Graphs

This paper deals the graphs for which the removal of any edge changes the majority domination number of the graph. γM -critical edges, γM -redundant edges, γM -durable graphs and γM -critical graphs are studied. Further, majority domination critical edges and majority domination critical graphs are characterized.

متن کامل

Majority domination vertex critical graphs

This paper deals the graphs for which the removal of any vertex changes the majority domination number of the graph. In the following section, how the removal of a single vertex fromG can change the majority domination number is surveyed for trees. Characterisation of V + M (G) and V − M (G) are determined.

متن کامل

Signed edge majority domination numbers in graphs

The open neighborhood NG(e) of an edge e in a graph G is the set consisting of all edges having a common end-vertex with e and its closed neighborhood is NG[e] = NG(e) ∪ {e}. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑x∈NG[e] f(x) ≥ 1 for at least a half of the edges e ∈ E(G), then f is called a signed edge majority dominating function of G. The minimum of the val...

متن کامل

Independent domination in directed graphs

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...

متن کامل

Total $k$-Rainbow domination numbers in graphs

Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1995

ISSN: 0012-365X

DOI: 10.1016/0012-365x(94)00194-n